All-to-All Communication on the Connection Machine CM-200
نویسندگان
چکیده
منابع مشابه
All-To-All Broadcast and Applications On the Connection Machine
An all{to{all broadcast algorithm that exploits concurrent communication on all channels of the Connection Machine system CM{200 binary cube network is described. Issues in integrating a physical all{to{all broadcast between processing nodes into a language environment using a global address space is dicussed. Timings for the physical broadcast between nodes, and the virtual broadcast are given...
متن کاملPOLYSHIFT Communications Software for the Connection Machine System CM-200
We describe the use and implementation of a polyshift function PSHIFT for circular shifts and end{oo shifts. Polyshift is useful in many scientiic codes using regular grids, such as nite diierence codes in several dimensions, multigrid codes, molecular dynamics computations, and in lattice gauge physics computations , such as Quantum Chromodynamics (QCD) calculations. Our implementation of the ...
متن کاملExtraction on Connection Machine CM - 5
(Summary of Results) Abstract In this paper, we present a parallel implementation of an image feature extraction task on Connection Machine CM-5. We show that, given a 2048 2048 grey level image as input, the extraction of image features, which includes edge detection, thinning, linking, and linear approximation , can be performed in less than 1.2 seconds on a partition of CM-5 having 512 proce...
متن کاملDistributed MIS via All-to-All Communication
Computing a Maximal Independent Set (MIS) is a central problem in distributed graph algorithms. This paper presents an improved randomized distributed algorithm for computing an MIS in an allto-all communication distributed model, known as the congested clique model, defined as follows: Given a graphG = (V ,E), initially each node knows only its neighbors. Communication happens in synchronous r...
متن کاملAll-to-All Personalized Communication on Circuit Switched Hypercubes
The all-to-all personalized communication is a massive data movement operation that arises frequently in problems like large matrix transposition on hypercube computers. In literature, various researchers have proposed routing methods to solve this problem using multiport packet switching communication, which is not practical. In this paper, we present a simple algorithm to solve this routing p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 1995
ISSN: 1058-9244,1875-919X
DOI: 10.1155/1995/637864